A Replica Replacement Algorithm Based on Value-Cost Prediction

نویسندگان

  • Tian Tian
  • Junzhou Luo
  • Zhiang Wu
چکیده

Data Grid is a new kind of data management infrastructure. To improve access efficiency, large amounts of data on Data Grids need to be replicated in the form of replicas at distributed sites. Due to the limited storage capacity, a good replica replacement algorithm is needed. This paper proposes a replica replacement algorithm based on value-cost prediction, which achieves a good balance between value and cost. The algorithm predicts replica value to select replicas that will be replaced in the first stage, and predicts the bandwidth to make replacement cost as low as possible in the second stage. Simulation shows that compared with traditional replacement algorithms our replica replacement algorithm contributes to better grid performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Increasing performance in Data grid by a new replica replacement algorithm

Data Grid provides sharing services for very large data around the world. Data replication is one of the most effective approaches to reduce access latency and response time. In addition to the benefits, replication has costs such as storage and bandwidth consumption, especially when storage space is low and limited. Therefore,  the data replacement should be done wisely. In this p...

متن کامل

A VO-Based Two-Stage Replica Replacement Algorithm

Due to high latency of the Internet, it becomes a challenge to access large and widely distributed data quickly and efficiently on data grids. Replication is a process to address this issue, by storing data in different locations to reduce access latency and improve data locality. However, because of the limited storage capacity, a good replica replacement algorithm is needed to improve the eff...

متن کامل

Dynamic Data Grid Replication Algorithm Based on Weight and Cost of Replica

Data Grid is composed of a large number of distributed computation and storage resources to facilitate the management of the huge distributed and sharing data resources efficiently. Dynamic replication can reduce the file storage time and use the grid resources effectively in a Data Grid environment. The Data Grid topology is divided into three layers: Regional level, LAN level, the grid site l...

متن کامل

Improving Data Availability Using Combined Replication Strategy in Cloud Environment

As grow as the data-intensive applications in cloud computing day after day, data popularity in this environment becomes critical and important. Hence to improve data availability and efficient accesses to popular data, replication algorithms are now widely used in distributed systems. However, most of them only replicate the static number of replicas on some requested chosen sites and it is ob...

متن کامل

Optimal Portfolio Allocation based on two Novel Risk Measures and Genetic Algorithm

The problem of optimal portfolio selection has attracted a great attention in the finance and optimization field. The future stock price should be predicted in an acceptable precision, and a suitable model and criterion for risk and the expected return of the stock portfolio should be proposed in order to solve the optimization problem. In this paper, two new criterions for the risk of stock pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007